Перевод: со всех языков на английский

с английского на все языки

to heap up like an

См. также в других словарях:

  • heap — n pile, stack, shock, cock, mass, bank (see under HEAP vb) Analogous words: *aggregate, aggregation, conglomerate, conglomeration: collection, assemblage (see under GATHER) heap vb Heap, pile, stack, shock, cock, mass, bank are comparable as… …   New Dictionary of Synonyms

  • Heap leaching — is an industrial mining process to extract precious metals and copper compounds from ore.ProcessThe mined ore is crushed into small chunks and heaped on an impermeable plastic and/or clay lined leach pad where it can be irrigated with a leach… …   Wikipedia

  • Heap — may refer to:In computer science: * heap (data structure), a tree like data structure * The heap (or free store ) is the area of memory used for dynamic memory allocationIn mathematics: *a heap (mathematics) is a generalization of a group.In… …   Wikipedia

  • heap|y — «HEE pee», adjective, heap|i|er, heap|i|est. forming a heap or heaps: »White heapy clouds, looking like balls…bring no rain (New Yorker) …   Useful english dictionary

  • List of Septimus Heap characters — This article catalogs the key characters from the books in the Septimus Heap series by Angie Sage. These include the books Magyk, Flyte, Physik, Queste and Syren. Some characters play a central role in all the books, while others are only central …   Wikipedia

  • Imogen Heap — Infobox musical artist Name = Imogen Heap Img capt = Imogen Heap at the 2006 Coachella Valley Music and Arts Festival Background = solo singer Birth name = Imogen Jennifer Jane Heap Born = Birth date and age|1977|12|9 Gender = female Died =… …   Wikipedia

  • Septimus Heap — is a series of books written by Angie Sage, featuring a protagonist with the same name as the series, Septimus Heap. Four books have been published, with three to come. The books are called Magyk , Flyte , Physik , Queste and Syren (forthcoming) …   Wikipedia

  • Min-max heap — A min max heap is a double ended priority queue implemented as a modified version of a binary heap. Like a binary heap, a min max heap is represented as a complete binary tree. Unlike a binary heap, though, the nodes in this tree do not obey the… …   Wikipedia

  • Imogen Heap — Surnom Immi Nom Imogen Jennifer Jane Heap Naissance 9 décembre 1977 Essex …   Wikipédia en Français

  • d-ary heap — The d ary heap or d heap is a priority queue data structure, a generalization of the binary heap in which the nodes have d children instead of 2.[1][2][3] Thus, a binary heap is a 2 heap. According to Tarjan[2] and Jensen et al …   Wikipedia

  • Soft heap — In computer science, the soft heap, designed by Bernard Chazelle in 2000, is a variant on the simple heap data structure. By carefully corrupting (increasing) the keys of at most a certain fixed percentage of values in the heap, it is able to… …   Wikipedia

Поделиться ссылкой на выделенное

Прямая ссылка:
Нажмите правой клавишей мыши и выберите «Копировать ссылку»